Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Finite state machine")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1092

  • Page / 44
Export

Selection :

  • and

On chaos of digital filters in the real worldLIN, T; CHUA, L. O.IEEE transactions on circuits and systems. 1991, Vol 38, Num 5, pp 557-558, issn 0098-4094, 2 p.Article

Exact solutions for the construction of optimal length test sequencesRODRIGUES, M; URAL, H.Information processing letters. 1993, Vol 48, Num 6, pp 275-280, issn 0020-0190Article

Fault masking by multiple timing faults in timed EFSM modelsWANG, Y; UYAR, M. O; BATTH, S. S et al.Computer networks (1999). 2009, Vol 53, Num 5, pp 596-612, issn 1389-1286, 17 p.Article

From xerox to aspell : A first prototype of a north sámi speller based on TWOL technologyGAUP, Børre; MOSHAGEN, Sjur; OMMA, Thomas et al.Lecture notes in computer science. 2006, pp 306-307, issn 0302-9743, isbn 978-3-540-35467-3, 1Vol, 2 p.Conference Paper

Thompson digraphs: A characterizationGIAMMARRESI, Dora; PONTY, Jean-Luc; WOOD, Derick et al.Lecture notes in computer science. 2001, pp 91-100, issn 0302-9743, isbn 3-540-42812-7Conference Paper

Deriving deadlock and unspecified reception free protocol converters from message mapping setsPEYRAVIAN, M; LEA, C.-T.Computer networks and ISDN systems. 1996, Vol 28, Num 13, pp 1831-1844, issn 0169-7552Article

Proving liveness for networks of communicating finite state machinesGOUDA, M. G; CHUNG-KUO CHANG.ACM transactions on programming languages and systems. 1986, Vol 8, Num 1, pp 154-182, issn 0164-0925Article

A Merging States Algorithm for Inference of RFSAsALVAREZ, Gloria; GARCIA, Pedro; RUIZ, José et al.Lecture notes in computer science. 2006, pp 340-341, issn 0302-9743, isbn 3-540-45264-8, 1Vol, 2 p.Conference Paper

Closing the gap between software modelling and codeWAGNER, F; WAGNER, T; WOLSTENHOLME, P et al.IEEE international conference and workshop on the engineering of computer-based systems. 2004, pp 52-59, isbn 0-7695-2125-8, 1Vol, 8 p.Conference Paper

Testing from a finite-state machine : Extending invertibility to sequencesHIERONS, R. M.Computer journal (Print). 1997, Vol 40, Num 4, pp 220-230, issn 0010-4620Article

Formalization of edges for the Grafcet state machineGUILLAUME, M; GRAVE, J.-M; CHLIQUE, P et al.CESA'96 IMACS Multiconference : computational engineering in systems applications. 1996, pp 579-583, isbn 2-9502908-7-6Conference Paper

Constructing checking sequences for distributed testingURAL, Hasan; WILLIAMS, Craig.Formal aspects of computing. 2006, Vol 18, Num 1, pp 84-101, issn 0934-5043, 18 p.Article

A T1 ones-density controlled band on finite-state machinesSABIN, M. J; OMURA, J. K; NIGHTINGILL, L et al.IEEE transactions on communications. 1990, Vol 38, Num 6, pp 906-914, issn 0090-6778, 9 p.Article

Retrieval in multimedia presentationsCELENTANOL, Augusto; GAGGI, Ombretta; SAPINO, Maria Luisa et al.Multimedia systems. 2004, Vol 10, Num 1, pp 72-82, issn 0942-4962, 11 p.Conference Paper

A similarity transform for linear finite state machinesKAGARIS, Dimitri.Discrete applied mathematics. 2006, Vol 154, Num 11, pp 1570-1577, issn 0166-218X, 8 p.Article

Type Classes of Context TreesMARTIN, Alvaro; SEROUSSI, Gadiel; WEINBERGER, Marcelo J et al.IEEE transactions on information theory. 2012, Vol 58, Num 7, pp 4077-4093, issn 0018-9448, 17 p.Article

Finnish optimality-theoretic prosodyKARTTUNEN, Lauri.Lecture notes in computer science. 2006, pp 9-10, issn 0302-9743, isbn 978-3-540-35467-3, 1Vol, 2 p.Conference Paper

Continuous hand gesture segmentation and co-articulation detectionBHUYAN, M. K; GHOSH, D; BORA, P. K et al.Lecture notes in computer science. 2006, pp 564-575, issn 0302-9743, isbn 3-540-68301-1, 1Vol, 12 p.Conference Paper

SProUT -A general-purpose NLP framework integrating finite-state and unification-based : Grammar formalismsDROZDZYNSKI, Witold; KRIEGER, Hans-Ulrich; PISKORSKI, Jakub et al.Lecture notes in computer science. 2006, pp 302-303, issn 0302-9743, isbn 978-3-540-35467-3, 1Vol, 2 p.Conference Paper

Modular verification of modular finite state machinesENDSLEY, E. W; TILBURY, D. M.IEEE Conference on Decision and Control. 2004, isbn 0-7803-8682-5, Vol 1, 972-979Conference Paper

Coevolution of birdsong grammar without imitationSASAHARA, Kazutoshi; IKEGAMI, Takashi.Lecture notes in computer science. 2003, pp 482-490, issn 0302-9743, isbn 3-540-20057-6, 9 p.Conference Paper

Modeling submit/response style systems with form charts and dialogue constraintsDRAHEIM, Dirk; WEBER, Gerald.Lecture notes in computer science. 2003, pp 267-278, issn 0302-9743, isbn 3-540-20494-6, 12 p.Conference Paper

Regular model checking made simple and efficientPAROSH AZIZ ABDULLA; JONSSON, Bengt; NILSSON, Marcus et al.Lecture notes in computer science. 2002, pp 116-130, issn 0302-9743, isbn 3-540-44043-7, 15 p.Conference Paper

Transducers with set outputCZYZOWICZL, Jurek; FRACZAK, Wojciech; PELC, Andrzej et al.Lecture notes in computer science. 2002, pp 300-309, issn 0302-9743, isbn 3-540-43996-X, 10 p.Conference Paper

Checking safety properties using induction and a SAT-solverSHEERAN, Mary; SINGH, Satnam; STALMARCK, Gunnar et al.Lecture notes in computer science. 2000, pp 108-125, issn 0302-9743, isbn 3-540-41219-0Conference Paper

  • Page / 44